Language Containment Checking with Nondeterministic BDDs
نویسنده
چکیده
Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for language containment checking between two Büchi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the specification automaton as an alternating automaton. We present a fixpoint algorithm for the emptiness check of alternating automata. The main data structure is a nondeterministic extension of binary decision diagrams that canonically represents sets of Boolean functions. This is a slightly revised version (April 2001) of the following article: c ©2001 Springer-Verlag. Bernd Finkbeiner. Language Containment Checking with Nondetermistic BDDs. In Tiziana Margaria and Wang Yi, editors, TACAS 2001. 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, pages 24–38.
منابع مشابه
XML Schema Containment Checking Based on Semi-implicit Techniques
XML schemas are computer languages defining grammars for XML (Extensible Markup Languages) documents. Containment checking for XML schemas has many applications, and is thus important. Since XML schemas are related to the class of tree regular languages, their containment checking is reduced to the language containment problem for non-deterministic tree automata (NTAs). However, an NTA for a pr...
متن کاملHSIS: A BDD-Based Environment for Formal Veri cation
Functional and timing veriication are currently the bottlenecks in many design eeorts. Simulation and emulation are extensively used for veriication. Formal veriication is now gaining acceptance in advanced design groups. This has been facilitated by the use of binary decision diagrams (BDDs). This paper describes the essential features of HSIS, a BDD-based environment for formal veriication: 1...
متن کاملWeak Parity Games and Language Containment of Weak Alternating Parity Automata
Optimisations of the state space of weak alternating parity automata (WAPA) are needed for example to speed up μTL model-checking algorithms which involve WAPA. It is assumed that deciding language containment for WAPA is helpful to perform such optimisations. In this paper the problem of language containment is reduced to the problem of computing winning sets in weak parity games. For the latt...
متن کاملRegular XPath: Constraints, Query Containment and View-Based Answering for XML Documents
In this paper we consider a powerful mechanism, called Regular XPath, for expressing queries and constraints over XML data, including DTDs and existential path constraints and their negation. Regular XPath extends XPath with binary relations over XML nodes specified by means two-way regular path queries. Our first contribution deals with checking satisfiability of Regular XPath constraints. Whi...
متن کاملRegular Expression Containment with xs:all-like Operators
We discuss containment checking for regular expressions with operators like XML Schema’s xs:all, that is, the operator that allows a sequence of letters to occur in arbitrary order. In this report, we model this operator by &, and give several algorithms of containment checking for regular expressions with &. Our algorithms are based on the notion of the permutability of word languages. Keyword...
متن کامل